Arc Routing Problems, Part II: The Rural Postman Problem
نویسندگان
چکیده
منابع مشابه
Reoptimizing the rural postman problem
Given an instance of the Rural Postman Problem (RPP) together with its optimal solution, we study the problem of finding a good feasible solution after a perturbation of the instance has occurred. We refer to this problem as the reoptimization of the RPP. We first consider the case where a new required edge is added. Second, we address the case where an edge (required or not) is removed. We sho...
متن کاملParameterized Rural Postman Problem
The Directed Rural Postman Problem (DRPP) can be formulated as follows: given a strongly connected directed multigraph D = (V,A) with nonnegative integral weights on the arcs, a subset R of A and a nonnegative integer l, decide whether D has a closed directed walk containing every arc of R and of total weight at most l. Let k be the number of weakly connected components in the the subgraph of D...
متن کاملSolving the Prize-collecting Rural Postman Problem
In this work we present an algorithm for solving the Prize-collecting Rural Postman Problem. This problem was recently defined and is a generalization of other arc routing problems like, for instance, the Rural Postman Problem. The main difference is that there are no required edges. Instead, there is a profit function on the edges that must be taken into account only the first time that an edg...
متن کاملThe directed profitable location Rural Postman Problem
In this paper we introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected and facilities must be located at both end-points of the selected arcs, and a tour must be identified that maximizes the difference between the profit collected along the arcs and the cost of traversing the arcs and inst...
متن کاملThe Rural Postman Problem with time windows
In this article we consider the Rural Postman Problem with Time Windows (RPPTW) for the undirected case. The problem occurs in the monitoring of roads for black-ice detection. We give different formulations and compare them on sets of instances adapted from the literature. We propose a cutting plane algorithm to solve the problem based on valid inequalities for the Traveling Salesman Problem wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 1995
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.43.3.399